Search results for "Deterministic system"
showing 4 items of 4 documents
Non-linear dynamics of alpha and theta rhythm: correlation dimensions and Lyapunov exponents from healthy subject's spontaneous EEG.
1997
The aim of the present paper was to analyze some non-linear dynamic properties of the resting EEG from healthy subjects under eyes closed conditions. For this purpose we digitally filtered the spontaneous EEG in the theta (3-8 Hz) and alpha frequency range (8-13 Hz) and considered these independent rhythms as signals from a deterministic system. Under certain conditions non-linear dynamic systems are able to generate deterministic chaos, which means that similar causes do not produce similar effects. This phenomenon is called sensitive dependence on initial conditions. From different lead positions (F3, F4, Cz, P3, P4, O1 and O2) we calculated the so-called correlation dimension D2, which i…
Influence of deterministic fluctuations on the 8-state Potts model
1999
We study a layered 8-state Potts model with an aperiodic modulation of the exchange couplings. Depending on its geometric properties, the aperiodic sequence may induce a 2nd order phase transition.
Internal Time and Innovation
2003
Consider a physical system that may be observed through time-varying quantities x t , where t stands for time that may be discrete or continuous. The set x t may be a realization of a deterministic system, e.g. a unique solution of a differential equation, or a stochastic process. In the latter case each x t is a random variable. We are interested in the global evolution of the system, not particular realizations x t , from the point of view of innovation. We call the evolution innovative if the dynamics of the system is such that there is a gain of information about the system as time increases. Our purpose is to associate the concept of internal time with such systems. The internal time w…
Quantum versus Probabilistic One-Way Finite Automata with Counter
2001
The paper adds the one-counter one-way finite automaton [6] to the list of classical computing devices having quantum counterparts more powerful in some cases. Specifically, two languages are considered, the first is not recognizable by deterministic one-counter one-way finite automata, the second is not recognizable with bounded error by probabilistic one-counter one-way finite automata, but each recognizable with bounded error by a quantum one-counter one-way finite automaton. This result contrasts the case of one-way finite automata without counter, where it is known [5] that the quantum device is actually less powerful than its classical counterpart.